Fast orthogonal least squares algorithm for efficient subset model selection
نویسندگان
چکیده
منابع مشابه
Fast orthogonal least squares algorithm for efficient subset model selection
An efficient implementation of the orthogonal least squares algorithm for subset model selection is derived in this correspondence. Computational complexity of the algorithm is examined and the result shows that this new fast orthogonal least squares algorithm significantly reduces computational requirements.
متن کاملEfficient computational schemes for the orthogonal least squares algorithm
The orthogonal least squares (OM) algorithm is an efficient implementation of the forward selection method for subset model selection. The ability to find good subset parameters with only a linearly increasing computational requirement makes this method attractive lor practical implementations. In this correspondence, we examine the computational complexity of the algorithm and present a prepro...
متن کاملOrthogonal-Least-Squares Forward Selection for
The objective of modelling from data is not that the model simply fits the training data well. Rather, the goodness of a model is characterized by its generalization capability, interpretability and ease for knowledge extraction. All these desired properties depend crucially on the ability to construct appropriate parsimonious models by the modelling process, and a basic principle in practical ...
متن کاملFast Rates for Regularized Least-squares Algorithm
We develop a theoretical analysis of generalization performances of regularized leastsquares on reproducing kernel Hilbert spaces for supervised learning. We show that the concept of effective dimension of an integral operator plays a central role in the definition of a criterion for the choice of the regularization parameter as a function of the number of samples. In fact a minimax analysis is...
متن کاملModel Selection for Regularized Least-Squares Algorithm in Learning Theory
We investigate the problem of model selection for learning algorithms depending on a continuous parameter. We propose a model selection procedure based on a worst case analysis and data-independent choice of the parameter. For regularized least-squares algorithm we bound the generalization error of the solution by a quantity depending on few known constants and we show that the corresponding mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 1995
ISSN: 1053-587X
DOI: 10.1109/78.398734